منابع مشابه
On C-homogeneous graphs and ordered pencils
Let C be a class of graphs. A definition of a C-homogeneous graph G is given that generalizes that of C-ultrahomogeneous graph by considering each induced subgraph of G in C tethered by an arc. Let 2 < r ∈ Z, σ ∈ (0, r − 1) ∩ Z, t = 2 − 1 and s = 2. We require G to have each edge shared by exactly one copy of the complete subgraph K2s and one of the Turán graph Tts,t. Letting C = {K2s, Tts,t} l...
متن کاملC-Homogeneous Graphs Via Ordered Pencils
Let C be a class of graphs closed under isomorphism and let ~ C be obtained from C by arc anchorage. A concept of ~ C-homogeneous graphs that include the C-ultrahomogeneous graphs is given, with the explicit construction of ~ C-homogeneous graphs that are not C-ultrahomogeneous, via ordered pencils of binary projective spaces.
متن کاملTripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملA Problem on Ordered Sets
1. Let S be an ordered set, of power 1 SI and order type 8 = 4, We denote by #* the converse of 4, i.e. the order type obtained from + by replacing every order relation x < y by the corresponding relation y < x, and by wrc the least ordinal number of power N,. It is easy to see that, if ISl=tQ, then S contains a subset S’ such that either s’ = w,, or 8’ = w**. For cardinals N, > w’. the corresp...
متن کاملCountable homogeneous and partially homogeneous ordered structures
I survey classification results for countable homogeneous or ‘partially homogeneous’ ordered structures. This includes some account of Schmerl’s classification of the countable homogeneous partial orders, outlining an extension of this to the coloured case, and also treating results on linear orders, and their generalizations, trees and cycle-free partial orders. 2000 Mathematics Subject Classi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1995
ISSN: 0195-6698
DOI: 10.1016/0195-6698(95)90049-7